Improved Parallel PageRank Algorithm for Spam Filtering
نویسندگان
چکیده
منابع مشابه
Parallel and Improved PageRank Algorithm for GPU-CPU Collaborative Environment
The internet is a huge collection of websites in the order of 10 bytes. Around 90% of the world’s population uses search engines for getting relevant information. According to Wikipedia, more than 200 million Indians use the Internet every day. Thus the correct data retrieval least time domain is the most important task. Hence need of efficient and parallel PageRanking algorithm. All the existi...
متن کاملClosure Operators and Spam Resistance for PageRank
We study the spammablility of ranking functions on the web. Although graph-theoretic ranking functions, such as Hubs and Authorities and PageRank exist, there is no graph theoretic notion of how spammable such functions are. We introduce a very general cost model that only depends on the observation that changing the links of a page that you own is free, whereas changing the links on pages owne...
متن کاملA Fuzzy Adaptive Multi-Population Parallel Genetic Algorithm for Spam Filtering
Nowadays, e-mail is one of the most inexpensive and expeditious means of communication. However, a principal problem of any internet user is the increasing number of spam, and therefore an efficient spam filtering method is imperative. Feature selection is one of the most important factors, which can influence the classification accuracy rate. To improve the performance of spam prediction, this...
متن کاملAn Ontology Enhanced Parallel SVM for Fast Spam Filtering
Spam, under a variety of shapes and forms, continues to inflict increased damage. Varying approaches including Support Vector Machine (SVM) techniques have been proposed for spam filter training and classification. However, SVM training is a computationally intensive process. This paper presents a MapReduce based parallel SVM algorithm for scalable spam filter training. By distributing, process...
متن کاملAn Improved Computation of the PageRank Algorithm
The Google search site (http://www.google.com) exploits the link structure of the Web to measure the relative importance of Web pages. The ranking method implemented in Google is called PageRank [3]. The sum of all PageRank values should be one. However, we notice that the sum becomes less than one in some cases. We present an improved PageRank algorithm that computes the PageRank values of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indian Journal of Science and Technology
سال: 2016
ISSN: 0974-5645,0974-6846
DOI: 10.17485/ijst/2016/v9i38/90410